The Key as Dictionary Compression Method of Inverted Index Table under the Hbase Database
نویسندگان
چکیده
Starting with Hbase's own characteristics, this paper designs an inverted index table which includes key word, document ID and position list, and the table can saves a lot of storage space. After then, on the basis of the table, the paper provides key as dictionary compression with high compression ratio and high decompression rate for the data block. At last, this paper tests the effectiveness of the compression method by comparing it with Lzo and Gzip which supported by Hbase.
منابع مشابه
FS-DS based Multi-sensor Data Fusion
REGULAR PAPERS Analyzing Temporal Constraints for Web Services Composition Ruiqiang Yu, Zhiqiu Huang, Lin Wang, and Hongjie Zhang Canonicalization in the PrIKL Reasoner Don Libes, Antoine Gerardin, Severin Tixier, and Fabian Neuhaus Evaluation System for Evaluating the VMS Guidance Effect Chengxiang Zhuge, Chunfu Shao, Changqing Zheng, Qiao Liang, and Jian Gao A Survey on Data Security Issues i...
متن کاملST-HBase: A Scalable Data Management System for Massive Geo-tagged Objects
In this paper, we propose ST-HBase (spatio-textual HBase) that can deal with large scale geo-tagged objects. ST-HBase can support high insert throughput while providing efficient spatial keyword queries. To the best of our knowledge, the existing approaches that deal with spatial keyword queries mainly focus on the static and medium-sized objects collections and cannot provide high insert throu...
متن کاملComposite Group-Keys - Space-Efficient Indexing of Multiple Columns for Compressed In-Memory Column Stores
Real world applications make heavy use of composite keys to reference entities. Indices over multiple columns are therefore mandatory to achieve response time goals of applications. We describe and evaluate the Composite Group-Key Index for fast tuple retrieval via composite keys from the compressed partition of in-memory column-stores with a main/delta architecture. Composite Group-Keys work d...
متن کاملAn Asymptotically Optimal Data Compression Algorithm Based on an Inverted Index
The usual method of representing a data sequence drawn from a nite alphabet associates with each location in the sequence, the source letter that appears there. An alternate approach is to associate with each source letter, the list of locations at which it appears in the data sequence [1]. We present a data compression algorithm based on a generalization of this idea. The algorithm parses the ...
متن کاملScalable Inverted Indexing on NoSQL Table Storage
The development of data intensive problems in recent years has brought new requirements and challenges to storage and computing infrastructures. Researchers are not only doing batch loading and processing of large scale of data, but also demanding the capabilities of incremental updates and interactive analysis. Therefore, extending existing storage systems to handle these new requirements beco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JSW
دوره 8 شماره
صفحات -
تاریخ انتشار 2013